package leet.ku._26;

public class Solution {
    public int removeDuplicates(int[] nums) {
    	if (nums == null || nums.length <= 0)
    		return 0;
    	
        int m = 0;
        for (int i = 1; i < nums.length; i++)
        	if (nums[i] > nums[m])
        		nums[++m] = nums[i];
        return m + 1;
    }
}